منابع مشابه
Fast Mutual Exclusion Algorithms Using Read-Modify-Write and Atomic Read/Write Registers
Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last algorithm is shown to be optimal in minimizing the number of remote memory accesses required in a resource busy period. Remote memory access is the key factor of memory access bottleneck in large shared-memory multiprocess...
متن کاملThe Cost of Concurrent, Low-Contention Read-Modify-Write
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify-Write operations (abbreviated as RMW), in a distributed system. We consider a natural class of RMW operations which give rise to a certain class of algebraic groups that we introduce here and call monotone groups. Our...
متن کاملLocal Read-Write Operations in Sensor Networks
Designing protocols and formulating convenient programming units of abstraction for sensor networks is challenging due to communication errors and platform constraints. This paper investigates properties and implementation reliability for a local read-write abstraction. Local read-write is inspired by the class of read-modify-write operations defined for shared-memory multiprocessor architectur...
متن کاملRead-Write Reductions
The discovery, more than a decade ago, of the relation between DistributedComputing (DC) and Algebraic-Topology (AT) raised the specter of requiring checking task solvability to be intimately connected to expertise in AT. Yet, in the area of Centralized Algorithms proving a problem to be NP or PSPACE complete requires more algorithmic expertise than complexity one. In analogy, we show that in D...
متن کاملWeak Read/Write Registers
In [14], Lamport has defined three classes of shared registers which support read and write operations, called —safe, regular and atomic—depending on their properties when several reads and/or writes are executed concurrently. We consider generalizations of Lamport’s notions, called k-safe, k-regular and k-atomic. First, we provide constructions for implementing 1-atomic registers (the stronges...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2004
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-003-0097-5